Efficient Distributed Admission Control for Anycast Flows
نویسندگان
چکیده
Anycasting becomes an important research topic recently especially for the replicated servers where availability and fault-tolerance are critical for quality of service. With anycasting, applications can request the “nearest” server for provision of a desired services. In this paper, we study efficient Admission Control for Anycast (ACA) flows. We focus on algorithms that perform smart destination selection and efficient route establishment weighing at the probe message round trip time (RTT). Taking advantages of anycasting, our ACA algorithms differ from other approach in their dependence on system status information. Performance data obtained through simulation show that our ACA system performs efficiently in terms of admission delay, overhead and admission probability.
منابع مشابه
Distributed Admission Control for Anycast Flows with QoS Requirements
In this paper, we study Distributed Admission Control (DAC) procedure for anycast flows with QoS requirements. We focus on algorithms that perform destination selection, which is critical in anycast. Several algorithms are proposed. These algorithms differ from each other in their dependence on system status information. We also address the issue of resource reservation and re-trial control in ...
متن کاملEffective Real-time Anycast Flow Connection Algorithm and Delay Analysis
Define anycast services as a group of replicated servers that may provide similar or identical services. Using anycast services can significantly simplify some applications such as to seek appropriate servers to provide quality of service and to achieve the load balance and fault-tolerance for service availability. An anycast flow is a sequence of packet that can be established between a user a...
متن کاملDecision Strategies for a P2P Computing System
Peer-to-Peer (P2P) computing (also called ‘public-resource computing’) is an effective approach to perform computation of large tasks. Currently used P2P computing systems (e.g., BOINC) are most often centrally managed, i.e., the final result of computations is created at a central node using partial results – what may be not efficient in the case when numerous participants are willing to downl...
متن کاملExplicit Rate Control for Anypoint Communication
This paper investigates explicit multiflow rate control for common forms of ensemble communication. We address rate control in the context of the Anypoint, a communication model that combines strong transport-layer guarantees with the flexibility of Anycast-style indirection. For example, Anypoint supports cluster-based services where extensible routers at the network edge route inbound request...
متن کاملAnycast Routing for Mobile Services
This paper considers the problem of locating and forwarding network traffic to any one of a set of distributed servers or service points—primarily in the context of mobile ad hoc networks. The advantages of providing such a capability through the use of anycast routing techniques at the network layer are discussed. We then illustrate how several different classes of unicast routing protocols ca...
متن کامل